Polish academics: Degrees in question

Question Analysis for Polish Question Answering

This study is devoted to the problem of question analysis for a Polish question answering system. The goal of the question analysis is to determine its general structure, type of an expected answer and create a search query for finding relevant documents in a textual knowledge base. The paper contains an overview of available solutions of these problems, description of their implementation and ...

Turing Degrees in Polish Spaces and Decomposability of Borel Functions

In this article we give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture on Borel functions from an analytic subset of a Polish space into a separable metrizable space. Our techniques employ deep results from effective descriptive set theory and recursion theory. In fact it is essential to prove that several prominent results in recursion t...

The Gamma question for many-one degrees

A set A is coarsely computable with density r ∈ [0,1] if there is an algorithm for deciding membership in A which always gives a (possibly incorrect) answer, and which gives a correct answer with density at least r. To any Turing degree a we can assign a value ΓT (a): the minimum, over all sets A in a, of the highest density at which A is coarsely computable. The closer ΓT (a) is to 1, the clos...

English loanwords in Polish and the question of gender assignment

Investigating Embedded Question Reuse in Question Answering

The investigation presented in this paper is a novel method in question answering (QA) that enables a QA system to gain performance through reuse of information in the answer to one question to answer another related question. Our analysis shows that a pair of question in a general open domain QA can have embedding relation through their mentions of noun phrase expressions. We present methods f...